Analysis of Cilk Scheduler

Lecture Summary 1. The Cilk Scheduler We review the Cilk scheduler. 2. Location of Shallowest Thread We define the depth of a thread and the shallowest thread. Next, We prove that the shallowest thread on a processor is either at the top of a deque or being executed. 3. Critical Threads We construct a computation graph G′ similar to the computation graph G, such that when a thread has no incomplete predecessors in G′, then it is at the top of a deque. 4. Execution Time Bounds For The Cilk Scheduler We present the execution time bounds of the Cilk scheduler. We introduce an accounting argument to help in proving the bound. 5. Performance Analysis of Scheduling Algorithm Using Delay Sequences We analyze the performance of the Cilk work-stealing scheduling algorithm. We define delay sequences and use them to prove the execution time bounds of the Cilk scheduler.